Functors for Coalgebras

نویسنده

  • H. PETER GUMM
چکیده

Functors preserving weak pullbacks provide the basis for a rich structure theory of coalgebras. We give an easy to use criterion to check whether a functor preserves weak pullbacks. We apply the characterization to the functor F which associates a set X with the set F(X) of all filters on X. It turns out that this functor preserves weak pullbacks, yet does not preserve weak generalized pullbacks. Since topological spaces can be considered as F -coalgebras, in fact they constitute a covariety, we find that the intersection of subcoalgebras need not be a coalgebra, and 1-generated F -coalgebras need not exist.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On descent for coalgebras and type transformations

We find a criterion for a morphism of coalgebras over a Barr-exact category to be effective descent and determine (effective) descent morphisms for coalgebras over toposes in some cases. Also, we study some exactness properties of endofunctors of arbitrary categories in connection with natural transformations between them as well as those of functors that these transformations induce between co...

متن کامل

Extensions of Functors From Set to V-cat

We show that for a commutative quantale V every functor Set −→ V -cat has an enriched leftKan extension. As a consequence, coalgebras over Set are subsumed by coalgebras over V -cat. Moreover, one can build functors on V -cat by equipping Set-functors with a metric. 1998 ACM Subject Classification F.4.1 Mathematical Logic

متن کامل

Coequational logic for accessible functors

Covarieties of coalgebras are those classes of coalgebras for an endofunctor H on the category of sets that are closed under coproducts, subcoalgebras and quotients. Equivalently, covarieties are classes of H-coalgebras that can be presented by coequations. Adámek introduced a logic of coequations and proved soundness and completeness for all polynomial functors on the category of sets. Here th...

متن کامل

Representations of First Order Function Types as Terminal Coalgebras

We show that function types which have only initial algebras for regular functors in the domains, i.e. first order function types, can be represented by terminal coalgebras for certain nested functors. The representation exploits properties of ω-limits and local ω-colimits.

متن کامل

Coalgebras for Binary Methods: Properties of Bisimulations and Invariants

COALGEBRAS FOR BINARY METHODS: PROPERTIES OF BISIMULATIONS AND INVARIANTS HENDRIK TEWS 1 Abstract. Coalgebras for endofunctors C C can be used to model classes of object-oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors Cop C C . This extension allows t...

متن کامل

A Calculus of Terms for Coalgebras of Polynomial Functors

A syntax and semantics of types, terms and formulas for coalgebras of polynomial functors is developed, extending earlier work [4] on monomial coalgebras to include functors constructed using coproducts. A modified ultrapower construction for polynomial coalgebras is introduced, adapting the conventional ultrapower to retain only those states that evaluate observable terms in a standard way. A ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001